On the Local Convergence of a Predictor-Corrector Method for Semidefinite Programming

We study the local convergence of a predictor-corrector algorithm for semideenite programming problems based on the Monteiro-Zhang uniied direction whose polynomial convergence was recently established by Monteiro. We prove that the suucient condition for superlinear convergence of Potra and Sheng applies to this algorithm and is independent of the scaling matrices. Under strict complementarity and nonde-generacy assumptions superlinear convergence with Q-order 1.5 is proved if the scaling matrices in the corrector step have bounded condition number. A version of the predictor-corrector algorithm enjoys quadratic convergence if the scaling matrices in both predictor and corrector steps have bounded condition numbers. The latter results apply in particular to algorithms using the AHO direction since there the scaling matrix is the identity matrix.